Two-level rectilinear Steiner trees
نویسندگان
چکیده
منابع مشابه
Two-level rectilinear Steiner trees
Given a set P of terminals in the plane and a partition of P into k subsets P1, . . . , Pk, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree Ti connecting the terminals in each set Pi (i = 1, . . . , k) and a top-level tree Ttop connecting the trees T1, . . . , Tk. The goal is to minimize the total length of all trees. This problem arises naturally in the design of lo...
متن کاملThe Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees
We consider the problem of finding a shortest rectilinear Steiner tree for a given set of points in the plane in the presence of rectilinear obstacles that must be avoided. We extend the Steiner ratio to the obstacle-avoiding case and show that it is equal to the Steiner ratio for the obstacle-free case.
متن کاملOptimal Rectilinear Steiner Minimal Trees in O (n22.62n) Time
This paper presents an algorithm that computes an optimal rectilinear Steiner minimal tree of n points in at most O(n 2 2:62 n) time. For instances small enough to solve in practice, this time bound is provably faster than any previous algorithm, and improves the previous best bound for practically solvable instances, which is O(n3 n). Experimental evidence is also presented that demonstrates t...
متن کاملApproaching the 5/4-Approximation for Rectilinear Steiner Trees
The rectilinear Steiner tree problem requires a shortest tree spanning a given vertex subset in the plane with rectilinear distance. It was proved that the output length of Zelikovsky's 25] and Berman/Ramaiyer 3] heuristics is at most 1.375 and 97 72 1:347 of the optimal length, respectively. It was claimed that these bounds are not tight. Here we improve these bounds to 1.3125 and 61 48 1:271,...
متن کاملRectilinear group Steiner trees and applications in VLSI design
Given a set of disjoint groups of points in the plane, the rectilinear group Steiner tree problem is the problem of nding a shortest intercon-nection (under the rectilinear metric) which includes at least one point from each group. This is an important generalization of the well-known rectilinear Steiner tree problem which has direct applications in VLSI design, i.e., it is the fundamental prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2017
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2016.11.002